منابع مشابه
Size sensitive packing number for Hamming cube and its consequences
We prove a size-sensitive version of Haussler’s Packing lemma [7] for set-systems with bounded primal shatter dimension, which have an additional size-sensitive property. This answers a question asked by Ezra [9]. We also partially address another point raised by Ezra regarding overcounting of sets in her chaining procedure. As a consequence of these improvements, we get an improvement on the s...
متن کاملPacking of points into the unit 6-dimensional cube
The best known estimate for the packing of points into the 6-dimensional unit cube in mutual distances at least 1 is improved. The following problem was stated in [10] and later repeated e.g. in [1], [6], [11], [12], [13]. “Let f(n) denote the maximum number of points that can be arranged in the n-dimensional unit cube so that all mutual distances are at least 1. Obviously, f(n) = 2n for n ≤ 3....
متن کاملOn Limits of Dense Packing of Equal Spheres in a Cube
We examine packing of n congruent spheres in a cube when n is close but less than the number of spheres in a regular cubic close-packed (ccp) arrangement of dp3/2e spheres. For this family of packings, the previous best-known arrangements were usually derived from a ccp by omission of a certain number of spheres without changing the initial structure. In this paper, we show that better arrangem...
متن کاملRubik's cube, music's cube
2017 marks the 40 anniversary of the Rubik’s Cube (under its original name the Magic Cube). This paper-demonstration describes explorations of the cube as a performance controller for music. The pattern of colors on a face of the cube is detected via USB video camera and supplemented by EMG data from the performer to model the performer’s interaction with the cube. This system was trialed in a ...
متن کاملSphere Packing Numbers for Subsets of the Boolean n-Cube with Bounded Vapnik-Chervonenkis Dimension
Let V f0; 1g n have Vapnik-Chervonenkis dimension d. Let M(k=n; V ) denote the cardinality of the largest W V such that any two distinct vectors in W di er on at least k indices. We show that M(k=n; V ) (cn=(k + d)) d for some constant c. This improves on the previous best result of ((cn=k) log(n=k)) d . This new result has applications in the theory of empirical processes. 1 The author gratefu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00647-3